Optimal Ordering Strategy for Goods at Multiple Retail Prices under Simultaneous Sales

Optimal Dynamic Auctions for Durable Goods: Posted Prices and Fire-sales∗

We consider a seller who wishes to sell K goods by time T . Potential buyers enter IID over time and are patient. At any point in time, profit is maximized by awarding the good to the agent with the highest valuation exceeding a cutoff. These cutoffs are characterized by a one-period-look-ahead rule and are deterministic, depending only on the number of units left and the time remaining. The cu...

THE LAW GOVERNING SALES OF GooDs AT COMMON LAW AND UNDER THE UNIFORM SALES ACT

Prices as Optimal Competitive Sales Mechanisms∗

We analyze the efficiency properties of price posting in a market where sellers compete for the buyers’ business. They key feature of the approach is to investigate price posting as an equilibrium outcome even if sellers can compete with other mechanisms. When buyers are homogeneous, we show equivalence between price posting and a large class of competing mechanisms, including second price auct...

Strategy-proof Voting for Multiple Public Goods

In a voting model where the set of feasible alternatives is a subset of a product set A = A1 × ·· · × Am of m finite categories, we characterize the set of all strategy-proof social choice functions for three different types of preference domains over A, namely for the domains of additive, completely separable, and weakly separable preferences over A.

Sales Forecasting for Retail Chains

This paper presents a use case of data mining for sales forecasting in retail demand and sales prediction. In particular, the Extreme Gradient Boosting algorithm is used to design a prediction model to accurately estimate probable sales for retail outlets of a major European Pharmacy retailing company. The forecast of potential sales is based on a mixture of temporal and economical features inc...